Efficient chunked java object heaps

ABSTRACT

A mechanism is disclosed for offset-based addressing in the chunks of a chunked heap. The mechanism provides for storing a side data structure within a portion of a chunk, where the side data structure begins at a predetermined offset within the range of virtual memory addresses allocated to the chunk. The side data structure comprises a plurality of entries, where each entry is associated with a corresponding section of the chunk. The mechanism provides for locating a particular entry in the side data structure corresponding to a particular section of the chunk by using the predetermined offset and an index derived based on the particular section, where locating the particular entry does not include performing any memory accessing operations or conditional branch operations to obtain an indirect reference to the side data structure.

BACKGROUND

The approaches described in this section are approaches that could bepursued, but not necessarily approaches that have been previouslyconceived or pursued. Therefore, unless otherwise indicated, it shouldnot be assumed that any of the approaches described in this sectionqualify as prior art merely by virtue of their inclusion in thissection.

When an Operating System (OS) initializes a process for execution, theOS assigns to the process a memory address space which begins at virtualaddress 0x0 and which may go up to the maximum memory address space thatthe particular OS can assign to a process. The memory address spaceassigned to a process is a virtual memory address space which, duringthe execution of the process, is mapped by the OS to physical memoryaddress space. (The physical memory address space used by a processduring the process' execution typically does not begin at physicaladdress 0x0.) For example, the virtual memory address space of a processmay be divided into virtual memory pages that are mapped by the OS tophysical memory pages. When a process is executing (i.e. during theruntime of a process), the OS also maps virtual addresses used by theprocess to the corresponding physical addresses in the physical memory.For example, when a process requests to access data at a particularvirtual memory address, the OS translates the particular virtual memoryaddress to the physical address in physical memory where the requesteddata is located.

When a process starts up, the process typically includes in its virtualmemory address space all the executable code of the process and allother data needed by the process. Examples of process data include, butare not limited to, heaps, stacks, and other permanent or temporary datastructures. In addition, a process may provide one or more componentsfor managing the virtual memory address space assigned thereto and fordynamically allocating virtual memory when needed (e.g., by making callsto a malloc( ) function that is included in a C runtime library).

One example of a process is a Java Virtual Machine (JVM). A JVM processwould typically provide one or more threads that are operable to managethe virtual memory address space of the JVM, for example, garbagecollectors and other memory management threads. In current JVMimplementations, JVM processes are operable to use contiguous heaps. Forexample, when a JVM process starts, the JVM process would typicallyallocate an object heap as a range of contiguous virtual memoryaddresses, where the size of the range is a parameter that may bepre-configured by a user or set by the JVM process itself. As usedherein, “heap” refers to a portion of virtual memory that is managed bythe process associated therewith. “Object heap” refers to a heap that isoperable to store objects, which are any entities that may beinstantiated by a process.

Contiguous heaps are widely used in process implementations because theyallow for offset-based indexing into side data structures, which areused to manage the heaps and any information stored therein. (As usedherein, “side data structure” refers to a portion of virtual memory thatstores metadata information about a heap.) For example, a JVM processmay use one or more side data structures to facilitate traversals andgarbage collection of the objects stored in a contiguous heap.

The use of contiguous heaps, however, has some disadvantages. Onedisadvantage is that once a process allocates a contiguous heap (usuallyat start-up), the process cannot thereafter dynamically increase ordecrease the size of the heap. This disadvantage is serious because theprocess cannot utilize its virtual memory address space efficiently. Forexample, if a process allocates a contiguous heap that is too big, theprocess may run out of virtual memory when it attempts to allocatememory for non-heap data. If a process allocates a contiguous heap thatis too small, the process may not have enough heap space for the heapdata that it needs during execution. This disadvantage is exacerbatedfor processes (e.g. servers and JVMs) that may need to run forrelatively long periods of time under uneven workloads.

To address this disadvantage of contiguous heaps, some processimplementations may use chunked heaps. (As used herein, “chunked heap”refers to a heap that comprises a plurality of chunks, which chunks arenot allocated in a contiguous range of virtual memory addresses.) Forexample, a process may allocate the chunks of a chunked heap only whenheap space is needed, and may de-allocate any heap chunks that are nolonger needed. In this way, a process may manage its virtual memoryaddress space more efficiently and may adjust the use of virtual memoryspace to the process' current workload.

Because chunked heaps include multiple chunks, chunked heaps do notallow for efficient offset-based indexing into side data structures. Forexample, according to one approach for using side data structures with achunked heap, a header is included in each chunk. Any informationrelated to a chunk (e.g. the size of the chunk, the location of sidedata structures associated with the chunk, etc.) is stored in a chunktable that is pointed to by a pointer stored into the chunk header. Thechunk table is an associated array that indexes the side data structuresfor all chunks in the chunked heap based on the base address of eachchunk. Look-ups into the chunk table for a particular chunk involveusing the pointer stored in the header of that particular chunk tolocate the associated array. A look-up is performed by using the baseaddress of a chunk as an index into the associated array, where thelook-up returns a pointer to a virtual memory address at which a sidedata structure associated with that chunk begins.

The disadvantage of the above approach for utilizing side datastructures with chunked heaps is that the approach uses at least onelevel of indirection in order to get from a chunk to a side datastructure associated with that chunk. Using indirection to access a sidedata structure is relatively slow because it involves at least one, andpossibly more, memory accessing operations. For example, in order toaccess a side data structure for a particular chunk, a process needs toperform multiple memory accessing operations to determine a pointer tothe side data structure (e.g. at least one memory accessing operation tolocate the chunk table, and at least one memory accessing operation toperform a look-up into the chunk table). Such memory accessingoperations are expensive and tend to hinder the process' performance ifthey are performed often.

Each chunk in a chunked heap may be specialized for storing a particulartype of information such as, for example, a particular type of objects.Thus, prior to performing operations on a specialized chunk, a processmay need to determine the type of the chunk in order to locate theexecutable instructions for the operations that need to be performed onthat chunk. Determining the type of a chunk, however, may involve one ormore expensive memory accessing operations. For example, according toone approach the type of a chunk may be stored in the chunk header or ina chunk table pointed to by a pointer stored in the chunk header—eitherway, a process needs to perform at least one memory accessing operationto determine the type of the chunk. In addition, after determining thetype of the chunk, the process may need to perform at least onebranching operation in order to get to the executable instructions forthe specific operations that need to be performed on chunks of thatparticular type. However, branching operations are also very expensiveand tend to hinder the process' performance if they are performed often.

Based on the forgoing, there is a clear need for techniques thatefficiently utilize chunked heaps and overcome the disadvantages of theapproach for utilizing chunked heaps that is described above.

SUMMARY

According to one embodiment, techniques are provided for offset-basedaddressing in the chunks of a chunked heap. The techniques provide forstoring a side data structure within a portion of a chunk, where theside data structure begins at a predetermined offset within the range ofvirtual memory addresses allocated to the chunk. The side data structurecomprises a plurality of entries, where each entry is associated with acorresponding section of the chunk. The techniques provide for locatinga particular entry in the side data structure corresponding to aparticular section of the chunk by using the predetermined offset and anindex derived based on the particular section. With this approach,locating the particular entry does not include performing any memoryaccessing operations to obtain an indirect reference to the side datastructure.

According to one embodiment, techniques are provided for storing one ormore chunk-specific sets of executable instructions at one or morepredetermined offsets within a chunk of a chunked heap. The techniquesprovide for storing a chunk-specific set of executable instructionswithin a portion of a chunk, where the set of executable instructionsbegins at a predetermined offset within the range of virtual memoryaddresses allocated to the chunk. The set of executable instructions,when executed, is operable to perform one or more operations that arespecific to the chunk. The techniques provide for accessing thechunk-specific set of executable instructions within the chunk based atleast in part on the predetermined offset, and for executing or causingthe execution of the chunk-specific set of executable instructions inorder to perform the one or more chunk-specific operations.

In some embodiments, the techniques described herein may be implementedin a JVM process. For example, in one embodiment a JVM process (or acomponent thereof) may store a side data structure at a predeterminedoffset within a chunk of a chunked heap. In another example, in oneembodiment the JVM process (or a component thereof) may store achunk-specific write barrier code at a predetermined offset within achunk of a chunked heap. When a bytecode interpreter of the JVM processinterprets the bytecodes of an operation that stores an object pointerinto a Java object, the interpreter would execute the write barrier codestored within the chunk. When a dynamic adaptive compiler of the JVMprocess generates the executable code of an operation that stores anobject pointer into a Java object, the dynamic adaptive compiler mayinsert a call to the write barrier code stored within the chunk.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an example system in which an embodimentmay be implemented.

FIG. 2A is a block diagram illustrating an example of a chunked heapaccording to one embodiment.

FIG. 2B is a block diagram illustrating an example structure of a chunkaccording to one embodiment.

FIG. 3 is a flow diagram illustrating an example method for using achunked heap according to one embodiment.

FIG. 4 is a block diagram illustrating the operation of a write barriercode according to one embodiment.

FIG. 5 is a block diagram illustrating an example of a chunk thatstores, at predetermined offsets, chunk-specific set of executableinstructions and a side data structure according to one embodiment.

FIG. 6 is a flow diagram illustrating an example method for using a setof executable instructions that is stored at a predetermined offsetwithin a chunk of a chunked heap according to one embodiment.

FIG. 7 is a block diagram that illustrates a computer system upon whichan embodiment may be implemented.

DETAILED DESCRIPTION OF EMBODIMENT(S)

I. Overview of an Example System

Described herein are techniques for efficiently utilizing side datastructures that are associated with a chunk of a chunked heap. Alsodescribed are techniques for storing chunk-specific executableinstructions within a chunk of a chunked heap, and for efficientlyaccessing the chunk-specific executable instructions within the chunk.The techniques described herein may be implemented in any process thatis operable to manage its virtual memory address space. Examples of suchprocesses include, but are not limited to, servers, services, daemons,JVMs, and any OS kernel processes (e.g. processes executing in thekernel of the OS) and user processes (e.g. processes executing in a useraddress space).

FIG. 1 is a block diagram of an example system in which an embodiment ofthe present invention may be implemented. For the purpose ofillustration, FIG. 1 depicts computer system 100 which includes a singleprocess, for example a JVM. However, it is noted that the techniquesdescribed herein are not limited to being implemented on computersystems that run a single process or within processes that are JVMs. Forpurposes of the techniques described herein, the functional componentsof FIG. 1 may be implemented on any type of computer system, includingbut not limited to, desktop computers, servers, portable computers (e.g.notebook or laptop computers, personal digital assistants (PDAs), etc.),and other computing devices (e.g. mobile phones).

As illustrated in FIG. 1, computer system 100 comprises OS 102 andprocess 104. OS 102 provides all of the underlying, low-levelfunctionalities that are relied upon by all of the other components inthe computer system. These functionalities include, but are not limitedto, assigning virtual memory space to processes, managing locks,managing processes, managing threads, etc. For purposes of thetechniques described herein, OS 102 may be any operating system,including but not limited to Solaris, Unix, Linux, Windows, DOS, Mac OS,etc.

OS 102 provides computing resources to one or more processes, such asprocess 104, that are executing under the control of the OS. Forexample, when OS 102 initializes a process for execution, the OS assignsto the process a virtual memory address space. Different operatingsystems allow different amounts of virtual memory address space to aprocess. In a computer system that uses 32-bit addressing, a process canhave a virtual memory address space that is addressable by 32-bitvirtual addresses (which amounts to 4 GB of virtual memory addressspace).

Process 104 executes under the control of OS 102 and may provide variousfunctionalities. Process 104 comprises a combination of softwarecomponents and an allocation of computing resources provided by OS 102.The software components of process 104 may include, for example, theexecutable code of the process, any data needed by the process forexecution, and any libraries that the process may be operable toutilize. The allocation of computing resources provided to process 104by OS 102 may include physical memory and Central Processing Unit (CPU)time during which a processor (e.g. a CPU) executes the executable codeof the process.

When process 104 is initialized by OS 102 and starts up, the process maystore its static executable code and process data in the virtual memoryaddress space provided by the OS. According to the techniques describedherein, process 104 uses a chunked heap. Thus, at start up process 104may also allocate ranges of virtual memory addresses that are to be usedfor a pre-configured number of heap chunks. Thereafter, duringexecution, process 104 may also dynamically allocate heap chunks in itsvirtual memory address space, and may also de-allocate any heap chunksthat are no longer in use.

Process 104 comprises memory manager 106 that is operable to manage thevirtual memory address space of the process. Memory manager 106 maycomprise a combination of software components (e.g. executable code) andan allocation of computing resources (e.g. physical memory and CPUtime). In the example embodiment illustrated in FIG. 1, memory manager106 may execute as one or more threads within the address space ofprocess 104. In other embodiments, memory manager 106 may include one ormore threads configured to execute within the address space of OS 102.Memory manager 106 is operable to allocate in virtual memory the chunksof the chunked heap used by process 104 when such chunks are needed bythe process. In addition, memory manager 106 may be operable todynamically allocate virtual memory that is used for variables, stacks,and any other non-heap data. Further, memory manager 106 may compriseone or more components that are operable to manage the virtual memoryallocated within the chunks of the chunked heap. For example, when thechunks used by process 104 are configured to store objects, memorymanager 106 may comprise one or more garbage collectors that areoperable to determine any unused objects and to reclaim the virtualmemory allocated to such unused objects within the chunks of the chunkedheap.

In an example embodiment, the techniques described herein provide forstoring one or more side data structures at one or more predeterminedoffsets within a chunk. In this example embodiment, the techniquesdescribed herein enable efficient offset-based access to entries in theone or more side data structures without performing any memory accessingoperations to obtain indirect references to the side data structures.Each side data structure comprises a plurality of entries, where eachentry is associated with a corresponding section of the chunk. Forexample, in a chunked object heap, a section of the chunk to which anentry in a side data structure corresponds may include, withoutlimitation, an object, a portion of an object (e.g. an object header), asection of the chunk which is equal to the minimal size of an object, ora card of a plurality of equal-sized cards. As used herein, “card”refers to a logical section of a chunk; a chunk may be logically dividedinto multiple cards. As used herein, “memory accessing operation” refersto an operation including at least one processor instruction whichfetches (or otherwise uses) an operand value from dynamic memory orwhich stores an operand value in dynamic memory.

In an example embodiment, the techniques described herein provide forstoring one or more chunk-specific sets of executable instructions atone or more predetermined offsets within a chunk. In this exampleembodiment, the techniques described herein provide for efficientlyaccessing the chunk-specific sets of executable instructions within thechunk based at least in part on the predetermined offsets, and forexecuting or causing the execution of the chunk-specific sets ofexecutable instructions. In some embodiments, the techniques describedherein may provide for storing both side data structures andchunk-specific sets of executable instructions within the same chunk.

In an example embodiment, the techniques described herein may beimplemented in a JVM process. For example, process 104 in FIG. 1 may bea JVM process executing under the control of OS 102, where computersystem 100 in which OS 102 operates may be a server computer system, aclient computer system, a portable computer system, a cellulartelephone, a PDA, or any other computing device. The JVM processprovides a platform for supporting execution of Java client and/orserver applications. The Java applications may execute as threads withinthe JVM process, which threads may instantiate and store one or moreJava objects in a chunked heap used by the JVM process. The JVM processmay utilize side data structures and chunk-specific sets of executableinstructions in accordance with the techniques described herein.

II. Side Data Structures within Chunks of a Chunked Heap

FIG. 2A is a block diagram illustrating a chunked heap according to anexample embodiment.

In FIG. 2A, the chunks of a chunked heap are allocated in virtual memoryaddress space 200. The chunked heap comprises chunks 210A, 210B, 210C,210D, and 210E, which chunks are allocated in ranges of virtual memoryaddresses that are non-contiguous. For example, chunk 210A is allocatedin virtual memory address space 200 between virtual addresses 8 MB and12 MB; chunk 210B is allocated in virtual memory address space 200between virtual addresses 12 MB and 16 MB; chunk 210C is allocated invirtual memory address space 200 between virtual addresses 20 MB and 24MB; chunk 210D is allocated in virtual memory address space 200 betweenvirtual addresses 36 MB and 40 MB; and chunk 210E is allocated invirtual memory address space 200 between virtual addresses 44 MB and 48MB. Chunks 210A-210E are not allocated in virtual memory address space200 all at the same time—thus, they don't need to be allocated in asingle contiguous range of virtual memory addresses. The processassociated with virtual memory address space 200 may allocate chunks210A-210E (and any additional chunks) by making calls to a memoryallocating function that may be provided by a memory manager, such as,for example, malloc( ) and mmap( ). In the example embodiment of FIG.2A, the chunks in the chunked heap are all of equal size (4 MB). It isnoted that in different embodiments, the size of the chunks in a chunkedheap may vary depending on the particular heap implementation.

The portions of virtual memory address space 200 between chunks210A-210E may be allocated to any non-heap data. Examples of non-heapdata include, but are not limited to, executable code, static and/ordynamic libraries, thread stacks, and any other code or data that may beallocated in the virtual memory address space of a process. Inembodiments in which a chunked heap is used by a JVM process, thenon-heap data may also include executable code generated by a dynamicadaptive compiler (e.g. a Just-In-Time (JIT) compiler).

In the example embodiment of FIG. 2A, chunks 210A-210E are eachallocated at a boundary identified by a virtual address in which acertain number of lower bits are zero. An example of such boundary isany boundary identified by a virtual address that is a multiple of avalue which itself is a power of 2. For example, in an OS that uses 4 KBphysical memory pages, the chunks of a chunked heap can be aligned atthe multiples of 4 KB address boundaries—so that each heap chunk wouldstart at some multiple of a 4 KB virtual address.

FIG. 2B is a block diagram illustrating the structure of a chunkaccording to an example embodiment. In this example embodiment, chunk210 is configured to store objects. For example, chunk 210 may beincluded in a chunked object heap that is utilized by a JVM process,where the JVM process is operable to instantiate objects and to storethe objects in the chunks of the chunked heap. The objects may beinstantiated from object-oriented classes or may be any objects utilizedby the JVM process.

According to the techniques described herein, chunk 210 comprises objectstore 212 and side data structures 214, 216, and 218. Object store 212is a range of virtual memory addresses within chunk 210 that is used forstoring objects. Each of side data structures 214, 216, and 218 beginsat a predetermined offset within the range of virtual memory addressesallocated to chunk 210. It is noted that the techniques described hereinare not limited to any particular number of side data structures thatcan be stored in a chunk; thus, the example chunk structure illustratedin FIG. 2B is to be regarded in an illustrative rather than arestrictive sense.

According to the techniques described herein, each side data structurestored in a chunk comprises a plurality of entries, where each entry isassociated with a corresponding section in the storage portion of thechunk. (The storage portion of the chunk is the portion that does notstore the side data structures.) For example, in FIG. 2B object store212 of chunk 210 is logically divided into sections S₁-S_(N). Side datastructure 214 includes entries E₁-E_(N), where each entry E_(i)corresponds to section S_(i) in object store 212. The predeterminedoffset at which a side data structure begins within a chunk and the sizeof the side data structure can be determined based on the size of anentry in the side data structure and the size of the sections to whichentries of the side data structure correspond.

For example, for any chunk of a given size, the number of sections inthe storage portion of the chunk can be determined by dividing the sizeof the chunk by the size of each chunk section. Multiplying the numberof sections in the chunk by the size of an entry in a side datastructure would yield the size of that side data structure. Thus, anyside data structure associated with a chunk of a given size would be ofa fixed, known size relative to the size of that chunk. The size of adata structure can be used to determine the offset at which the sidedata structure may be stored in the chunk depending on where the sidedata structure is to be stored within the chunk. For instance, if a sidedata structure is to be stored in the high portion of a chunk, theoffset at which the side data structure begins in the chunk may bedetermined by subtracting the size of the side data structure from thelargest virtual memory address allocated to the chunk plus one. If achunk stores more than one side data structure, the offset at which eachside data structure begins within the chunk may be determined in asimilar way, except that the size of any already allocated side datastructure would also need to be accounted for when the offsets aredetermined.

According to the techniques described herein, a process that is aware ofthe predetermined offset at which a side data structure begins within achunk may be operable to locate the side data structure and any entriesstored therein without performing any memory accessing operations. Forexample, suppose that the chunks of a chunked heap used by a process areof equal size, and that each chunk stores a side data structure of thesame size. Thus, the side data structure would begin at the samepredetermined offset within each chunk. This predetermined offset may bestored in a processor register or may appear as a constant operand inthe instruction stream of the process that needs it to access the sidedata structure. When the process needs to access the side data structureof a particular chunk, the process would be able to determine thevirtual address of the side data structure by adding the predeterminedoffset stored in the processor register to the base address of theparticular chunk without the need to perform any memory accessingoperations. This is in contrast to approaches that use chunk tables toindex the side data structures of all chunks in a chunked heap, whereaccessing the chunk table to determine the virtual address of a sidedata structure would require at least one memory accessing operation.

In this manner, the techniques described herein obviate the need to useindirection when locating a side data structure associated with a chunk.By storing side data structures at predetermined offsets within a chunk,the techniques described herein avoid the use of memory accessingoperations. Instead, the techniques described herein may use one or moreoperations which involve only processor instructions that have registeroperands. An example of such operation is an arithmetic operation forperforming address computations by using only processor instructionshaving register operands. Since modern processors are operable toexecute processor instructions having register operands extremely fastand since in modern computer architectures dynamic memory tends to belocated ever further away from the processors, execution of instructionshaving register operands is virtually free while instructions thatfetch, use, or store memory operands are very costly for the processorsto execute. In addition, using arithmetic operations to perform addresscomputations leads to faster execution because arithmetic operationsoverall tend to include fewer processor instructions than other types ofoperations.

FIG. 3 is a flow diagram illustrating a method for using a chunked heapaccording to an example embodiment.

In step 302, a process (or a component thereof) allocates a first rangeof virtual memory addresses that is to be used for a first chunk of achunked heap. In step 304, the process (or a component thereof)allocates a second range of virtual memory addresses that is to be usedfor a second chunk of the chunked heap. The first range of virtualmemory addresses (allocated to the first chunk) and the second range ofvirtual addresses (allocated to the second chunk) are not allocated in acontiguous range of virtual memory addresses.

In step 306, the process (or a component thereof) stores a side datastructure in a portion of the second chunk. The side data structurebegins at a predetermined offset within the second range of virtualmemory addresses. The side data structure comprises a plurality ofentries, where each entry is associated with a corresponding section ofthe second chunk.

For example, the side data structure may be a marking bitmap that isused by the process (or by a component thereof, such as a garbagecollector) to perform efficient garbage collection over objects that arestored in the second chunk. Each entry in the marking bitmap may be abit that corresponds to a range of virtual addresses in the second chunkthat is equal to the minimum size of an object that can be stored in thechunk.

In another example, the side data structure may be a cardmark array thatis used by the process (or by a component thereof, such as a garbagecollector) to perform efficient garbage collection over objects that arestored in the second chunk. Each entry in the cardmark array may be onebyte that corresponds to a range of virtual addresses in the secondchunk where the range represents one card of a plurality of equal-sizedcards into which the second chunk may be logically divided.

In step 308, the process (or a component thereof) locates a particularentry in the side data structure by using the predetermined offset (atwhich the side data structure begins in the second chunk) and an indexderived based on the particular section in the second chunk to which theparticular entry corresponds. According to the techniques describedherein, in locating the particular entry the process (or the componentthereof) does not perform any memory accessing operations to obtain anindirect reference to the side data structure.

For example, suppose that the side data structure stored in the secondchunk is a marking bitmap, and the process needs to determine an entryinto the marking bitmap that corresponds to a particular object storedin the second chunk. Based on the virtual address of the particularobject, the process can determine the base address of the second chunkby zeroing out the low order bits of the virtual address of the object.Next, the value indicated by the low order bits of the virtual addressof the particular object can be used to determine an index into themarking bitmap by using scaling, where the index identifies the entry inthe marking bitmap that corresponds to the particular object. Forexample, the scaling may involve dividing the value indicated by the loworder bits of the virtual address of the particular object by theminimum size which an object can occupy in the second chunk. Thereafter,the virtual memory address of the corresponding entry in the markingbitmap can be determined by adding the base address of the second chunk,the predetermined offset (at which the marking bitmap begins in thesecond chunk), and the index that was computed by scaling the valueindicated by the low order bits of the virtual address of the particularobject. According to the techniques described herein, the processdetermines the virtual memory address of the corresponding entry in themarking bitmap without performing any memory accessing operations.

The method in FIG. 3 is described with respect to the second chunk forillustrative purposes only. It is noted that steps 306 and 308 may beperformed with respect to any chunk in a chunked heap and to any sidedata structure stored therein including, without limitation, the firstchunk and any chunk allocated at any time in the virtual memory addressspace of the process.

In one example embodiment, the techniques described herein may beperformed by a JVM process that uses a chunked object heap. In thisembodiment, the JVM process may execute under the control of an OS thatprovides physical memory pages of a certain size. According to thetechniques described herein, in this embodiment the JVM process may beconfigured to allocate chunks that are of the same size as the physicalmemory pages. For example, the physical memory pages provided by the OSmay be 4 MB, and the chunks allocated by the JVM process may also be 4MB. Since according to the techniques described herein side datastructures associated with a chunk are stored within that chunk, the JVMprocess would never cause an OS page fault when the JVM process attemptsto access a side data structure after accessing an object in the chunk.This is in contrast to approaches that use chunk tables to index theside data structures of all chunks in a chunked heap because suchapproaches may cause OS page faults when a chunk and its associated sidedata structure are located on separate physical memory pages. Since anOS page fault is a very expensive operation, in this example embodimentthe techniques described herein provide for improved processperformance.

III. Garbage Collection and Write Barrier Code

The techniques described herein may be performed by a JVM process thatuses a chunked object heap. The JVM process may include a memory managerthat comprises one or more garbage collectors. As used herein, “garbagecollector” refers to a set of code which, when executed, is operable toperform garbage collection. For example, a garbage collector may beimplemented as a thread that may comprise a combination of softwarecomponents (e.g. a set of executable code) and an allocation ofcomputing resources (e.g. physical memory and CPU time). As used herein,“garbage collection” refers to a mechanism for determining any unusedobjects in a heap and for reclaiming the virtual memory allocated tounused objects.

Most objects that are instantiated and stored by a JVM process tend tobecome unreferenced or no longer needed rather quickly. For example,while a Java application is executing it tends to instantiate and storeon the heap of a JVM process a lot of temporary objects, which are usedfor a short period of time and thereafter are not accessed any more.Thus, only a few objects stored on the heap of a JVM process tend tolive (e.g. to being referenced and/or used) for a long time. Objectsthat have just been instantiated and stored on the heap are referred toherein as “young generation” objects; young generation objects that livefor longer periods of time are usually promoted to (and referred toherein as) “old generation” objects. For the purposes of garbagecollection, it is easier and more efficient to separate young generationobjects and old generation objects in separate portions of an objectheap. Since young and old generation objects have different garbagedensity, a JVM process may apply different types of garbage collectorsto perform garbage collection over the different portions of the heapthat store the young and the old generation objects.

Accordingly, in a JVM process that uses a chunked object heap, it wouldbe more efficient to store young generation objects and old generationobjects in separate chunks. In this way, the JVM process can apply onetype of a garbage collector on a chunk that stores young generationobjects, and a different type of a garbage collector on a chunk thatstores old generation objects.

For example, to collect over young generation objects, the JVM processmay use a garbage collector that implements a scavenger collectionalgorithm. An example of such garbage collector is the semi-spacegarbage collector. A semi-space garbage collector may traverse the younggeneration objects stored in a chunk and may determine which objects arestill alive; thereafter, the semi-space garbage collector would copy thelive objects to a different chunk (and/or a different portion of thesame chunk). In this way, the semi-space garbage collector operatesefficiently on a chunk storing relatively few live young generationobjects because the collector can reclaim a large amount of virtualmemory while copying out relatively few alive objects. For chunksstoring old generation objects the JVM may use a different garbagecollector than the collector for young generation objects. For example,the JVM process may use a garbage collector that identifies dead objectsand thereafter reclaims the virtual memory of the dead objects bycompacting the objects that are still alive. In this way, the garbagecollector for old generation objects can efficiently reclaim virtualmemory in a chunk that stores a large number of alive old generationobjects with relatively few dead objects in between.

It is a challenging task to efficiently implement generational garbagecollectors in a JVM process that uses a chunked object heap. In order todetermine whether a particular object is alive, a garbage collectorneeds to determine whether the particular object is reachable from aroot object through object pointers stored in other intermediateobjects. Since in a typical JVM process there would be a lot more oldgeneration objects than young generation objects, determining whether ayoung generation object is referenced by any old generation object mayrequire the garbage collector to traverse a large number of oldgeneration objects. In a chunked object heap, this problem isexacerbated because the young and old generation objects would betypically stored in separate chunks.

In order to address this problem, an example embodiment uses writebarrier code and side data structures to facilitate efficient garbagecollection over young generation objects. As used herein, “write barriercode” refers to a set of executable code which, when executed, isoperable to perform a particular operation or operations with respect toa particular side data structure or structures. In this exampleembodiment, a JVM process executes a write barrier code every time theJVM process (or a component thereof) stores an object pointer within anold generation object. When executed, the write barrier code determinesan entry in a side data structure, where the entry corresponds to thevirtual address within the old generation object at which the objectpointer is being stored. In order to efficiently utilize the virtualmemory address space allocated to a chunk of old generation objects, inthis example embodiment an entry into the side data structure maycorrespond to a chunk section that may store multiple objects and/orparts of objects. Thus, the write barrier code may use scaling whendetermining the corresponding entry in the side data structure.

After determining the corresponding entry in the side data structure thewrite barrier code marks the entry, for example, by storing someparticular value in the entry. Thereafter, when garbage collection isperformed over the young generation objects, the garbage collectorinspects the entries in the side data structure and traverses only thoseold generation objects that are associated with marked entries. In thisway, the write barrier code eliminates the need for the garbagecollector to traverse all old generation objects when determiningwhether young generation objects are alive.

In this example embodiment, the techniques described herein facilitateefficient execution of the write barrier code. Since according to thetechniques described herein a side data structure is stored at apredetermined, known offset within a chunk, the write barrier code wouldnot need to perform any memory accessing operations when locating anentry in the side data structure.

FIG. 4 is a block diagram illustrating the operation of a write barriercode according to this example embodiment. A JVM process (not shown inFIG. 4) uses a chunked object heap that includes chunks 402 and 410.Chunk 402 is configured for storing young generation objects. Storedwithin chunk 402 may be one or more side data structures, such as, forexample, side data structure 404.

As illustrated in FIG. 4, chunk 410 is configured for storing oldgeneration objects, such as, for example, objects 416A, 416B, 416C,416D, 416E, 416F, 416G, etc. Chunk 410 is logically divided into aplurality of equal-sized cards, such as, for example, cards 414.Cardmark array 412 is stored at a predetermined, known offset withinchunk 410. Cardmark array 412 comprises a plurality of entries whereeach entry is one byte that is associated with, and corresponds to, oneof cards 414. Ellipsis 415 indicates that chunk 410 may include othercards 414 and other old generation objects. (For illustrations purposesonly, in FIG. 4 cardmark array 412 is depicted above chunk 410. Further,in FIG. 4 chunk 410 is depicted as storing only one cardmark array.According to the techniques described herein, however, multiple sidedata structures such as cardmark arrays or marking bitmaps may be storedwithin a chunk.)

In the example embodiment of FIG. 4, when the JVM process allocateschunk 410, the JVM process creates cardmark array 412 within the chunkand initializes each byte of the cardmark array to the value “1”.Thereafter, the JVM process (or any component thereof) is operable toexecute a write barrier code to mark an entry in cardmark array 412every time an object pointer is stored in any object in chunk 410. Forexample, the JVM process may use a dynamic adaptive compiler to inlinethe write barrier code after each operation that stores an objectpointer. In another example, the JVM process may use an interpreter ofbytecodes to include an execution of the write barrier code at eachoperation that stores an object pointer. (In the example embodimentillustrated in FIG. 4, it is irrelevant whether the object pointer beingstored references an old generation object or a young generation object;in other embodiments, it may be relevant with respect to the writebarrier code whether the object pointer being stored references an oldgeneration object or a young generation object.)

For example, suppose that the JVM process executes an operation to storean object pointer in object 416E. After storing the object pointer inobject 416E, the JVM process executes the write barrier code to mark thecorresponding entry 418 in cardmark array 412.

According to the techniques described herein, the write barrier codefirst determines the base address of chunk 410 based on the particularvirtual address of the location (in object 416E) where the objectpointer is being stored. Since in this embodiment all chunks areallocated at a boundary that is a multiple of a power-of-2 value, thewrite barrier code may execute an arithmetic operation to zero out thelower order bits of the particular virtual address. Then, the writebarrier code scales the value of the lower order bits of the particularvirtual address to determine an index into cardmark array 412, whichindex determines where entry 418 is located. In the particular exampleof FIG. 4, the write barrier code may compute the index by performingone or more arithmetic operations to divide the value of the lower orderbits of the particular virtual address by the size of card 414 (whichsize is predetermined or otherwise known). Thereafter, to determine thevirtual address of entry 418, the write barrier code adds the baseaddress of chunk 410, the predetermined offset in chunk 410 at whichcardmark array 412 begins, and the computed index into cardmark array412. According to the techniques described herein, in determining thevirtual address of entry 418 the write barrier code does not perform anymemory accessing operations but instead performs only arithmeticoperations having register operands and/or constant operands from theinstruction stream of the write barrier code. After determining thevirtual address of entry 418, the write barrier code marks the entry by,for example, executing a processor instruction to set to “0” the valueof the byte located at the virtual address of entry 418.

When a garbage collector is executed to perform garbage collection overthe objects in chunk 402 (which stores young generation objects), thegarbage collector inspects cardmark array 412. For each entry incardmark array 412 that is marked, the garbage collector determines thecorresponding card 414 in chunk 410, and traverses only the objectsstored therein to find out whether any object pointers stored in theseobjects reference a young generation object in chunk 402. For example,the garbage collector would find that entry 418 is marked as a “0”,would traverse the objects in the corresponding card 414, and would findthe object pointer stored in object 416E. Since the expectation is thatthere would be few marked entries in cardmark array 412, the garbagecollector would need to inspect for any object pointers the objects in arelatively few cards in chunk 410 instead of inspecting all oldgeneration objects in the chunk.

While in the example of FIG. 4 a write barrier code is described withrespect to a cardmark array, the techniques described herein are not inany way limited to being implemented by a write barrier code or for sidedata structures that are cardmark arrays. In various embodiments, anyset of code may use the techniques described herein to efficientlyaccess side data structures that are different than cardmark arrays,such as, for example, marking bitmaps and block offset tables. A blockoffset table for a chunk is a side data structure that includes offsetinformation indicating how far back a garbage collector needs to go tofind the beginning of an object when the object spans a card boundary ina cardmark array. For example, with respect to FIG. 4, chunk 410 mayinclude a block offset table which would include an entry indicating anoffset, from a card boundary, indicating where object 416D starts;similar entries may also be included for objects 416C and 416F.

In other embodiments, a read barrier code may use the techniquesdescribed herein to efficiently locate entries in side data structures.As used herein, “read barrier code” refers to a set of executable codethat is executed for operations that read object references. Forexample, a semi-space garbage collector may be operable to not update orotherwise correct pointers in objects that the collector is copying out.In this example, the semi-space collector may use a read barrier code tofigure out, on every object read operation, where a particular object ismoved and to fix any affected object pointers accordingly.

IV. Chunk-Specific Executable Instructions within Chunks of a ChunkedHeap

The techniques described herein provide for storing a chunk-specific setof executable instructions at a predetermined offset within a chunk of achunked heap. A chunk-specific set of executable instructions may beefficiently accessed within a chunk based at least in part on thepredetermined offset. When executed, the chunk-specific set ofexecutable instructions stored in a particular chunk may be operable toperform one or more operations that are specific to that particularchunk. In some embodiments, the techniques described herein may providefor storing, within the same chunk, both one or more side datastructures and one or more chunk-specific sets of executableinstructions.

FIG. 5 is a block diagram illustrating the structure of a chunk thatstores, at predetermined offsets, two chunk-specific sets of executableinstructions and a side data structure according to an exampleembodiment. In this example embodiment, chunk 510 is configured to storeobjects. For example, chunk 510 may be included in a chunked object heapthat is utilized by a JVM process, where the JVM process is operable toinstantiate objects from object-oriented classes and to store theobjects in the chunks of the chunked heap.

According to the techniques described herein, chunk 510 comprises objectstore 512, chunk-specific sets of executable instructions 514 and 516,and side data structure 518. Object store 512 is a range of virtualmemory addresses within chunk 510 that is used for storing objects. Eachof executable instruction sets 514 and 516 begins at a predeterminedoffset within the range of virtual memory addresses allocated to chunk510. Side data structure 518 is a range of virtual memory addresses thatalso begins at a predetermined offset within the range of virtual memoryaddresses allocated to chunk 510. When executed, each of executableinstruction sets 514 and 516 is operable to perform operations that arespecific to chunk 510. For example, executable instruction set 514 maybe a write barrier code which is executed each time an object pointer isstored in any object within object store 512 and which, when executed,is operable to locate and mark a corresponding entry in side datastructure 518. Executable instruction set 516 may be a set of executableinstructions which, when executed, is operable to determine and/orreturn some specific information about chunk 510 (for example,information indicating whether the chunk is configured to store young orold generation objects). It is noted that the sets of executableinstructions 514 and 516 need not be of the same size as long as each ofset of executable instructions starts at a well-known fixed offsetwithin chink 510. For illustration purposes only, chunk 510 is depictedin FIG. 5 as storing two sets of executable instructions and one sidedata structure; however, it is noted that the techniques describedherein are not limited to any particular number of sets of executableinstructions and/or any particular number of side data structures thatcan be stored in a chunk at some fixed offsets. For this reason, theexample chunk structure illustrated in FIG. 5 is to be regarded in anillustrative rather than a restrictive sense.

FIG. 6 is a flow diagram illustrating a method for using a set ofexecutable instructions that is stored at a predetermined offset withina chunk of a chunked heap according to an example embodiment.

In step 602, a process (or a component thereof) allocates a first rangeof virtual memory addresses that is to be used for a first chunk of achunked heap. In step 604, the process (or a component thereof)allocates a second range of virtual memory addresses that are to be usedfor a second chunk of the chunked heap. The first range of virtualmemory addresses (allocated to the first chunk) and the second range ofvirtual addresses (allocated to the second chunk) are not allocated in acontiguous range of virtual memory addresses.

In step 606, the process (or a component thereof) stores a set ofexecutable instructions within the second chunk. The set of executableinstructions begins at a predetermined offset within the second range ofvirtual memory addresses. When executed, the set of executableinstructions is operable to perform one or more operations that arespecific to the second chunk.

In step 608, the process (or a component thereof) accesses the set ofexecutable instructions within the second chunk based at least on thepredetermined offset. The process (or a component thereof) may include acall to the set of executable instructions. The call comprises aprocessor instruction including as an operand the virtual memory addressof the beginning of the set of executable instructions within the chunk.The virtual memory address of the set of executable instructions may bedetermined by adding the predetermined offset to the base address of thechunk.

After accessing the set of executable instructions within the chunk, instep 610 the process (or a component thereof) may execute the set ofexecutable instructions to perform the one or more chunk-specificoperations. When the set of executable instructions completes execution,execution control is returned to the entity that called the set ofexecutable instructions (for example, the process or a componentthereof).

The method in FIG. 6 is described with respect to the second chunk forillustrative purposes only. It is noted that steps 606 and 608 may beperformed with respect to any chunk in a chunked heap and to any set ofexecutable instructions stored therein including, without limitation,the first chunk and any chunk allocated at any time in the virtualmemory address space of the process.

In one embodiment, the techniques described herein may be performed by aJVM process that uses a chunked object heap. In this embodiment, the JVMprocess may include a memory manager that comprises one or more garbagecollectors operable to perform garbage collection in the chunks of thechunked object heap, where each chunk stores either young generationobjects or old generation objects.

In a contiguous object heap, each of young and old generation objectsmay be stored in a different portion of the contiguous heap. If a JVMprocess using such contiguous object heap needs to resize the portionsof the heap allocated to the young and the old generations of objects,the JVM process would need to set a divider pointer (e.g. the virtualmemory address that divides the heap into portions) accordingly and thenstore objects on either side of the divider pointer depending on whetherthe objects are young or old generation objects. Thus, the JVM processcan determine whether a particular object is in the young or the oldgeneration by comparing the virtual address of the particular object tothe divider pointer. Similarly, the JVM process can determine whether anobject pointer stored within an old generation object references a youngor an old generation object by comparing the object pointer to thedivider pointer.

In a chunked object heap, each chunk of the heap may be configured ordedicated for storing either young or old generation objects. Forexample, in some embodiments one chunk may be configured for storingyoung generation objects and all other chunks in the chunked heap may beconfigured for storing old generation objects. In these embodiments, aJVM process using the chunked heap can determine whether a particularobject is in the young or the old generation by determining whether ornot the virtual address of the particular object is an address withinthe range of virtual memory addresses allocated to the young generationchunk. In a typical chunked object heap, each chunk may include a chunkheader that stores a bit indicating the type of the chunk (e.g. whetheror not the chunk is configured for storing young generation objects). AJVM process using a traditional chunked object heap can determinewhether a particular object is in the young or the old generation bylooking up the address of the base of the chunk in a table stored inmemory. Thus, to determine the type of a chunk in a traditional chunkedobject heap, the JVM process may need to perform one or more memoryaccessing operations which, when performed often, may hinder theexecution performance of the process.

According to the techniques described herein, in one embodiment a JVMprocess may comprise a dynamic adaptive compiler that is operable togenerate executable code during the runtime of the JVM process. In thisembodiment, when the JVM process or a component thereof allocates achunk in the virtual memory address space of the process, the dynamicadaptive compiler generates a set of executable instructions that arespecific to that chunk. According to the techniques described herein,the JVM process (or a component thereof) may store such dynamicallygenerated sets of executable instructions at the same predeterminedoffset within each chunk that is allocated by the JVM process. Aparticular set of executable instructions stored in a particular chunkis such that when executed, the particular set of executableinstructions is operable to return a value indicating whether theparticular chunk is configured for storing young or old generationobjects. For example, when the JVM process (or a component thereof suchas a garbage collector) needs to determine whether an object pointerstored within an old generation object references a young or an oldgeneration object, the JVM process or the component thereof may:determine the base address of the chunk referenced by the object pointer(e.g. by zeroing out the lower order bits of the object pointer); addthis base address to the predetermined offset at which a set ofexecutable instructions is stored within that chunk; and make a call tothe set of executable instructions, which when executed would return avalue indicating the type of that chunk. Thus, according to thetechniques described herein, the JVM process or the component thereofmay determine the type of a chunk that stores an object referenced by anobject pointer without performing any memory accessing operations, whichwould improve the overall execution performance of the JVM process.

The techniques described herein for storing chunk-specific executableinstructions at a predetermined offset within a chunk of a chunked heapare not limited to any particular type of chunk-specific executableinstructions. Rather, the techniques described herein may be used forany type of executable instructions that can be specialized, on aper-chunk basis, with respect to the chunks of a chunked heap. For thisreason, the examples of chunk-specific executable instructions providedin the present disclosure are to be regarded in an illustrative ratherthan a restrictive sense.

V. Write Barrier Code Implemented as Chunk-Specific ExecutableInstructions

In one operational context, a JVM process using a chunked object heapmay comprise one or more garbage collectors operable to perform garbagecollection in the chunks of the heap, where each chunk stores eitheryoung generation objects or old generation objects. In this operationalcontext, when the JVM process or component thereof performs an operationto store an object pointer into a particular object, the JVM process mayneed to use a different write barrier code depending on whether theparticular object is a young generation object or an old generationobject.

For example, if the particular object (into which an object pointer isbeing stored) is a young generation object, then no write barrier codewould need to be executed; if the particular object is an old generationobject, then the JVM process would need to execute a write barrier codein order to determine and mark an entry into an associated side datastructure (which subsequently may be used by a garbage collector thatperforms garbage collection of young generation objects). Since in thisoperational context the write barrier code (or lack thereof) for chunksstoring young generation objects is different than the write barriercode for chunks storing old generation objects, a dynamic adaptivecompiler of the JVM process cannot directly inline the write barriercode with all operations that store object pointers into objects.Rather, the dynamic adaptive compiler would need to generate, and inlinewith each object pointer store operation, a set of executable code thatfirst determines whether an object pointer is being stored in a young oran old generation object, and then branches into the write barrier codeif the operation is being performed in an old generation object. Thus,when performing an operation to store an object pointer in an object, inthis operational context the JVM process may need to perform at leastone memory accessing operation (to determine the type of the object intowhich an object pointer is being stored), and possibly a branchingoperation (if the write barrier code needs to be performed). Performinga lot of memory accessing and/or branching operations, however, mayhinder the execution performance of the JVM process. The JVM process ora bytecode interpreter thereof would encounter a similar issue wheninterpretively executing the bytecodes of operations that store objectpointers into objects.

To address this issue, in one example embodiment a JVM process providesa fixed offset for storing write barrier code into the chunks of achunked object heap. According to the techniques described herein, eachchunk would include a portion for storing write barrier code, where theportion begins at the fixed offset within the range of virtual memoryaddress allocated to that chunk by the JVM process (or by a componentthereof). In this way, the JVM process (or a component thereof such as adynamic adaptive compiler) would have a fixed, known location in eachchunk where the write barrier code specific to that chunk is stored.When the JVM process or a component thereof executes an operation tostore a pointer into a particular object that is stored in a particularchunk, the write barrier code may be invoked based on the fixed offsetwithout first determining whether the particular chunk is configured forstoring young or old generation objects.

In this example embodiment, the write barrier code for a chunk storingyoung generation objects may be a single return instruction. The writebarrier code for a chunk storing old generation objects may be a set ofexecutable instructions which, when executed, is operable to locate andmark a corresponding entry in a side data structure associated with thechunk. (The side data structure associated with the chunk may also bestored at some known, predetermined offset within the chunk). The writebarrier code for any particular chunk is stored at the same fixed, knownoffset within that particular chunk regardless of whether the chunk isconfigured for storing old or young generation objects.

According to the techniques described herein, when a dynamic adaptivecompiler of the JVM process is compiling an operation that stores anobject pointer into a particular object in a particular chunk, thedynamic adaptive compiler generates code that includes a call to thewrite barrier code. When executed, this generated code would firstdetermine the base address of the particular chunk (e.g. by zeroing outthe lower order bits of the virtual memory address at which the objectpointer is being stored). Then, the generated code would add this baseaddress to the fixed offset (at which write barrier code is stored inany chunk) in order to determine the virtual memory address at which thewrite barrier code for the particular chunk is located. The generatedcode would then call the write barrier code at the determined virtualmemory address, which would be a virtual address in the particularchunk.

When the JVM process or a component thereof executes the executable codefor the operation that stores the object pointer into the particularobject in the particular chunk, the JVM process or the component thereofwould execute the code generated by the dynamic adaptive compiler inorder to invoke the write barrier code stored in that particular chunk.If the particular chunk happens to store young generation objects, thenthe write barrier code would be a single return instruction that wouldbe executed immediately and would return execution control to the JVM orthe component thereof. If the particular chunk happens to store oldgeneration objects, then the write barrier code would be a set ofexecutable instructions which, when executed, would locate and mark acorresponding entry in a side data structure associated with thatparticular chunk. When the write barrier code completes execution, itwould return execution control to the JVM or the component thereof.

Similarly, when a bytecode interpreter of the JVM process isinterpreting (e.g. from the source code of a Java application) anoperation that stores an object pointer into a particular object in aparticular chunk, the bytecode interpreter would execute a call to thewrite barrier code stored in that particular chunk. For example, thebytecode interpreter would first determine the base address of theparticular chunk (e.g. by zeroing out the lower order bits of thevirtual memory address at which the object pointer is being stored).Then, the bytecode interpreter would add this base address to the fixedoffset (at which write barrier code is stored in any chunk) in order todetermine the virtual memory address at which the write barrier code forthe particular chunk is located. The bytecode interpreter would theninvoke the write barrier code in the particular chunk based on thedetermined virtual memory address. If the particular chunk happens tostore young generation objects, then the write barrier code would be asingle return instruction which would immediately return executioncontrol to the bytecode interpreter. If the particular chunk happens tostore old generation objects, then the write barrier code would be a setof executable instructions which would locate and mark a correspondingentry in a side data structure associated with that particular chunk,and thereafter would return execution control to the bytecodeinterpreter.

In some embodiments, a set of executable instructions stored at a fixedoffset within a chunk may be changed during the lifetime of that chunk.For example, a chunk configured for storing young generation objects maybe changed in its entirety to a chunk storing old generation objects.This may happen when a JVM process or component thereof determines thatit is more efficient to promote to the old generation all or a largenumber of the young generation objects stored in the chunk instead ofcopying these objects out. (For instance, it may be more efficient togarbage collect the few dead objects from the chunk and then change thetype of the chunk to old generation instead of allocating a new chunk,designating it an old generation chunk, and then copying the aliveobjects into the new chunk.) In this example, when the type of the chunkis changed to old generation, the JVM process (or a component thereofsuch as a dynamic adaptive compiler) would generate the write barriercode specific to this chunk, and would store the generated write barriercode at the fixed offset within the chunk (thus replacing the writebarrier code previously stored therein). In this way, the techniquesdescribed herein provide for a chunked heap utilization that is trulydynamic.

VI. Hardware Overview

FIG. 7 is a block diagram that illustrates a computer system upon whichan embodiment of the techniques described herein may be implemented.Computer system 700 includes a bus 702 for facilitating informationexchange, and one or more processors 704 coupled with bus 702 forprocessing information. Computer system 700 also includes a main memory706, such as a random access memory (RAM) or other dynamic storagedevice, coupled to bus 702 for storing information and instructions tobe executed by processor 704. Main memory 706 also may be used forstoring temporary variables or other intermediate information duringexecution of instructions by processor 704. Computer system 700 mayfurther include a read only memory (ROM) 708 or other static storagedevice coupled to bus 702 for storing static information andinstructions for processor 704. A storage device 710, such as a magneticdisk or optical disk, is provided and coupled to bus 702 for storinginformation and instructions.

Computer system 700 may be coupled via bus 702 to a display 712 fordisplaying information to a computer user. An input device 714,including alphanumeric and other keys, is coupled to bus 702 forcommunicating information and command selections to processor 704.Another type of user input device is cursor control 716, such as amouse, a trackball, or cursor direction keys for communicating directioninformation and command selections to processor 704 and for controllingcursor movement on display 712. This input device typically has twodegrees of freedom in two axes, a first axis (e.g., x) and a second axis(e.g., y), that allows the device to specify positions in a plane.

In computer system 700, bus 702 may be any mechanism and/or medium thatenable information, signals, data, etc., to be exchanged between thevarious components. For example, bus 702 may be a set of conductors thatcarries electrical signals. Bus 702 may also be a wireless medium (e.g.air) that carries wireless signals between one or more of thecomponents. Bus 702 may further be a network connection that connectsone or more of the components. Any mechanism and/or medium that enableinformation, signals, data, etc., to be exchanged between the variouscomponents may be used as bus 702.

Bus 702 may also be a combination of these mechanisms/media. Forexample, processor 704 may communicate with storage device 710wirelessly. In such a case, the bus 702, from the standpoint ofprocessor 704 and storage device 710, would be a wireless medium, suchas air. Further, processor 704 may communicate with ROM 708capacitively. Further, processor 704 may communicate with main memory706 via a network connection. In this case, the bus 702 would be thenetwork connection. Further, processor 704 may communicate with display712 via a set of conductors. In this instance, the bus 702 would be theset of conductors. Thus, depending upon how the various componentscommunicate with each other, bus 702 may take on different forms. Bus702, as shown in FIG. 7, functionally represents all of the mechanismsand/or media that enable information, signals, data, etc., to beexchanged between the various components.

The invention is related to the use of computer system 700 forimplementing the techniques described herein. According to oneembodiment, those techniques are performed by computer system 700 inresponse to processor 704 executing one or more sequences of one or moreinstructions contained in main memory 706. Such instructions may be readinto main memory 706 from another machine-readable medium, such asstorage device 710. Execution of the sequences of instructions containedin main memory 706 causes processor 704 to perform the process stepsdescribed herein. In alternative embodiments, hard-wired circuitry maybe used in place of or in combination with software instructions toimplement the invention. Thus, embodiments of the invention are notlimited to any specific combination of hardware circuitry and software.

The term “machine-readable medium” as used herein refers to any mediumthat participates in providing data that causes a machine to operate ina specific fashion. In an embodiment implemented using computer system700, various machine-readable media are involved, for example, inproviding instructions to processor 704 for execution. Such a medium maytake many forms, including but not limited to, non-volatile media,volatile media, and transmission media. Non-volatile media includes, forexample, optical or magnetic disks, such as storage device 710. Volatilemedia includes dynamic memory, such as main memory 706. Transmissionmedia includes coaxial cables, copper wire and fiber optics, includingthe wires that comprise bus 702. Transmission media can also take theform of acoustic or light waves, such as those generated duringradio-wave and infra-red data communications.

Common forms of machine-readable media include, for example, a floppydisk, a flexible disk, hard disk, magnetic tape, or any other magneticmedium, a CD-ROM, DVD, or any other optical storage medium, punchcards,papertape, any other physical medium with patterns of holes, a RAM, aPROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, orany other physical medium from which a computer can read.

Common forms of machine-readable media include, for example, a floppydisk, a flexible disk, hard disk, magnetic tape, or any other magneticmedium, a CD-ROM, DVD, or any other optical storage medium, punchcards,papertape, any other physical medium with patterns of holes, a RAM, aPROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, orany other physical medium from which a computer can read.

Various forms of machine-readable media may be involved in carrying oneor more sequences of one or more instructions to processor 704 forexecution. For example, the instructions may initially be carried on amagnetic disk of a remote computer. The remote computer can load theinstructions into its dynamic memory and send the instructions over atelephone line using a modem. A modem local to computer system 700 canreceive the data on the telephone line and use an infra-red transmitterto convert the data to an infra-red signal. An infra-red detector canreceive the data carried in the infra-red signal and appropriatecircuitry can place the data on bus 702. Bus 702 carries the data tomain memory 706, from which processor 704 retrieves and executes theinstructions. The instructions received by main memory 706 mayoptionally be stored on storage device 710 either before or afterexecution by processor 704.

Computer system 700 also includes a communication interface 718 coupledto bus 702. Communication interface 718 provides a two-way datacommunication coupling to a network link 720 that is connected to alocal network 722. For example, communication interface 718 may be anintegrated services digital network (ISDN) card or a modem to provide adata communication connection to a corresponding type of telephone line.As another example, communication interface 718 may be a local areanetwork (LAN) card to provide a data communication connection to acompatible LAN. Wireless links may also be implemented. In any suchimplementation, communication interface 718 sends and receiveselectrical, electromagnetic or optical signals that carry digital datastreams representing various types of information.

Network link 720 typically provides data communication through one ormore networks to other data devices. For example, network link 720 mayprovide a connection through local network 722 to a host computer 724 orto data equipment operated by an Internet Service Provider (ISP) 726.ISP 726 in turn provides data communication services through theworld-wide packet data communication network now commonly referred to asthe “Internet” 728. Local network 722 and Internet 728 both useelectrical, electromagnetic or optical signals that carry digital datastreams. The signals through the various networks and the signals onnetwork link 720 and through communication interface 718, which carrythe digital data to and from computer system 700, are exemplary forms ofcarrier waves transporting the information.

Computer system 700 can send messages and receive data, includingprogram code, through the network(s), network link 720 and communicationinterface 718. In the Internet example, a server 730 might transmit arequested code for an application program through Internet 728, ISP 726,local network 722 and communication interface 718.

The received code may be executed by processor 704 as it is received,and/or stored in storage device 710, or other non-volatile storage forlater execution. In this manner, computer system 700 may obtainapplication code in the form of a carrier wave.

At this point, it should be noted that although the invention has beendescribed with reference to specific embodiments, it should not beconstrued to be so limited. Various modifications may be made by thoseof ordinary skill in the art with the benefit of this disclosure withoutdeparting from the spirit of the invention. These and othermodifications are within the scope of the present invention. Thus, theinvention should not be limited by the specific embodiments used toillustrate it but only by the scope of the issued claims and theequivalents thereof.

1. A machine-implemented method, comprising: allocating a first range ofvirtual memory addresses to be used for a first chunk of a heap;allocating a second range of virtual memory addresses to be used for asecond chunk of the heap, wherein the first and the second ranges ofvirtual memory addresses are not contiguous; storing a side datastructure in a portion of the second chunk, wherein the side datastructure begins at a predetermined offset within the second range ofvirtual memory addresses, and wherein the side data structure comprisesa plurality of entries with each entry associated with a correspondingsection of the second chunk; and locating a particular entry in the sidedata structure corresponding to a particular section of the second chunkwithout performing any memory accessing operations to obtain an indirectreference to the side data structure, wherein locating the particularentry comprises: determining a base address of the second chunk byzeroing out a predetermined set of low order bits of a particularvirtual address within the particular section of the second chunk;scaling a value indicated in the set of low order bits of the particularvirtual address to determine an index into the side data structure,wherein the index identifies the particular entry which corresponds tothe particular section of the second chunk; and determining a virtualaddress of the particular entry by adding the base address of the secondchunk, the predetermined offset, and the index that identifies theparticular entry within the side data structure.
 2. The method of claim1, wherein the side data structure stored in the second chunk is any oneof: a marking bitmap associated with a plurality of sections in thesecond chunk, wherein each section in the plurality of section is sizedto the minimum size of objects stored in the second chunk; a cardmarkarray associated with a plurality of sections in the second chunk,wherein the plurality of sections are a plurality of equal-sized cards;and a block offset table associated with objects stored in the secondchunk.
 3. The method of claim 1, wherein locating the particular entryin the side data structure comprises performing one or more operations,wherein each of the one or more operations comprises processorinstructions that include only operands which are stored in registers.4. The method of claim 1, wherein: the heap is an object heap configuredfor storing objects; and the object heap comprises a plurality ofequal-sized chunks that include the first and the second chunks.
 5. Themethod of claim 1, wherein: the method is performed during runtime by aJava Virtual Machine (JVM) process; and the heap is an object heap thatis configured to store Java objects.
 6. The method of claim 5, furthercomprising: storing a set of Java objects in the second chunk, whereinthe set of Java objects is designated as an old generation of objects.7. The method of claim 6, further comprising: storing an object pointerat the particular virtual address within a particular Java object of theset of Java objects, wherein storing the object pointer comprisesexecuting write barrier code.
 8. The method of claim 7, wherein thewrite barrier code, when executed, causes locating the particular entryin the side data structure.
 9. The method of claim 8, wherein the writebarrier code, when executed, further causes marking the particular entryto indicate that the object pointer has been stored at the particularvirtual address in the particular Java object.
 10. The method of claim9, further comprising: performing garbage collection over the set ofJava objects stored in the second chunk, wherein performing the garbagecollection comprises accessing the side data structure.
 11. Amachine-readable storage medium, comprising: instructions for causingone or more processors to allocate a first range of virtual memoryaddresses to be used for a first chunk of a heap; instructions forcausing one or more processors to allocate a second range of virtualmemory addresses to be used for a second chunk of the heap, wherein thefirst and the second ranges of virtual memory addresses are notcontiguous; instructions for causing one or more processors to store aside data structure in a portion of the second chunk, wherein the sidedata structure begins at a predetermined offset within the second rangeof virtual memory addresses, and wherein the side data structurecomprises a plurality of entries with each entry associated with acorresponding section of the second chunk; and instructions for causingone or more processors to locate a particular entry in the side datastructure corresponding to a particular section of the second chunkwithout performing any memory accessing operations to obtain an indirectreference to the side data structure, wherein the instructions forcausing one or more processors to locate the particular entry comprise:instructions for causing one or more processors to determine a baseaddress of the second chunk by zeroing out a predetermined set of loworder bits of a particular virtual address within the particular sectionof the second chunk; instructions for causing one or more processors toscale a value indicated in the set of low order bits of the particularvirtual address to determine an index into the side data structure,wherein the index identifies the particular entry which corresponds tothe particular section of the second chunk; and instructions for causingone or more processors to determine a virtual address of the particularentry by adding the base address of the second chunk, the predeterminedoffset, and the index that identifies the particular entry within theside data structure.
 12. The machine-readable storage medium of claim11, wherein the side data structure stored in the second chunk is anyone of: a marketing bitmap associated with a plurality of sections inthe second chunk, wherein each section in the plurality of sections issized to the minimum size of objects stored in the second chunk; acardmark array associated with a plurality of sections in the secondchunk, wherein the plurality of sections are a plurality of equal-sizedcards; and a block offset table associated with objects stored in thesecond chunk.
 13. The machine-readable storage medium of claim 11,wherein the instructions for causing one or more processors to locatethe particular entry in the side data structure further compriseinstructions for causing one or more processors to perform one or moreoperations, wherein each of the one or more operations comprisesprocessor instructions that include only operands which are stored inregisters.
 14. The machine-readable storage medium of claim 11, wherein:the heap is an object heap configured for storing objects; and theobject heap comprises a plurality of equal-sized chunks that include thefirst and the second chunks.
 15. The machine-readable storage medium ofclaim 11, further comprising: instructions for causing one or moreprocessors to execute a Java Virtual Machine (JVM) process, wherein theinstructions for causing one or more processors to execute the JVMprocess comprise the instructions for causing one or more processors toallocate the first and the second ranges of virtual memory addresses;wherein the heap is an object heap that is configured to store Javaobjects.
 16. The machine-readable storage medium of claim 15, furthercomprising: instructions for causing one or more processors to store aset of Java objects in the second chunk, wherein the set of Java objectsis designated as an old generation of objects.
 17. The machine-readablestorage medium of claim 16, further comprising: instructions for causingone or more processors to store an object pointer at the particularvirtual address within a particular Java object of the set of Javaobjects, wherein storing the object pointer comprises executing writebarrier code.
 18. The machine-readable storage medium of claim 17,wherein the write barrier code includes the instructions for causing oneor more processors to locate the particular entry in the side datastructure.
 19. The machine-readable storage medium of claim 18, whereinthe write barrier code further comprises instructions for causing one ormore processors to mark the particular entry to indicate that the objectpointer has been stored at the particular virtual address in theparticular Java object.
 20. The machine-readable storage medium of claim19, further comprising: instructions for causing one or more processorsto perform garbage collection over the set of Java objects stored in thesecond chunk, wherein the instructions for causing one or moreprocessors to perform the garbage collection comprise instructions forcausing one or more processors to access the side data structure.